Arithmetic for Parallel Linear Recursive Query Evaluation in Deductive Databases
نویسندگان
چکیده
An arithmetic approach, such as the Level-Finding method described in this paper for evaluating linear recursive queries in deductive database systems provides great potential for parallel processing. It has advantages over other approaches using state-of-the-art parallel processing technology to improve processing speed. In the arithmetic approach, we identify two kind of parallelism, namely bridge node parallelism and formula parallelism. In this paper, the arithmetic foundations and algorithm to exploit formula parallelism were given. The algorithm is fully parallel.
منابع مشابه
Constraint-Based Query Evaluation in Deductive Databases
Constraints play an important role in the efficient query evaluation in deductive databases. In this paper, constraint-based query evaluation in deductive databases is investigated, with the emphasis on linear recursions with function symbols. Constraints are classified into three classes: (i) rule constraints, (ii) integrity constraints, and (iii) query constraints. Techniques are developed fo...
متن کاملClassification and Compilation of Linear Recursive Queries in Deductive Databases
In this paper, we present a graph model which is powerful in classifying and compiling linear recursive formulas in deductive databases. The graph model consists of two kinds of graphs: I-graph and Resolution Graph. We can extract essential properties of a recursive formula from its I-graph and can easily figure out the compiled formula and the query evaluation plan of the recursive formula fro...
متن کاملChain-Split Evaluation in Deductive Databases
Many popularly studied recursions in deductive databases can be compiled into one or a set of highly regular chain generating paths, each of which consists of one or a set of connected predicates. Previous studies on chain-based query evaluation in deductive databases take a chain generating path as an inseparable unit in the evaluation. However, some recursions, especially many functional recu...
متن کاملOptimizing Query Answering in Description Logics using Disjunctive Deductive Databases
Motivated by the possibilities of applying deductive database technology for efficient query answering in description logics, we present a translation operator μ that transforms non-recursive ALC ontologies into a disjunctive deductive database. Contrary to our previous work, in this paper we focus on handling negation, disjunction and existential quantifiers, which cannot be handled by deducti...
متن کاملCounting solutions to the View Maintenance Problem
We present an incremental evaluation algorithm for materialized views in relational and deductive database systems. The algorithm computes, in an incremental fashion, the changes to the materialized view in response to changes (insertions, deletions, and updates) to the base relations. The view may be deened in SQL or in Datalog, and may use UNION , negation, aggregation (e.g. SUM, MIN), linear...
متن کامل